Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Classification of functional magnetic resonance imaging data based on semi-supervised feature selection by spectral clustering
ZHU Cheng, ZHAO Xiaoqi, ZHAO Liping, JIAO Yuhong, ZHU Yafei, CHENG Jianying, ZHOU Wei, TAN Ying
Journal of Computer Applications    2021, 41 (8): 2288-2293.   DOI: 10.11772/j.issn.1001-9081.2020101553
Abstract348)      PDF (1318KB)(370)       Save
Aiming at the high-dimensional and small sample problems of functional Magnetic Resonance Imaging (fMRI) data, a Semi-Supervised Feature Selection by Spectral Clustering (SS-FSSC) model was proposed. Firstly, the prior brain region template was used to extract the time series signal. Then, the Pearson correlation coefficient and the Order Statistics Correlation Coefficient (OSCC) were selected to describe the functional connection features between the brain regions, and spectral clustering was performed to the features. Finally, the feature importance criterion based on Constraint score was adopted to select feature subsets, and the subsets were input into the Support Vector Machine (SVM) classifier for classification. By 100 times of five-fold cross-validation on the COBRE (Center for Biomedical Research Excellence) schizophrenia public dataset in the experiments, it is found that when the number of retained features is 152, the highest average accuracy of the proposed model to schizophrenia is about 77%, and the highest accuracy of the proposed model to schizophrenia is 95.83%. Experimental result analysis shows that by only retaining 16 functional connection features for classifier training, the model can stably achieve an average accuracy of more than 70%. In addition, in the results obtained by the proposed model, Intracalcarine Cortex has the highest occurrence frequency among the 10 brain regions corresponding to the functional connections, which is consistent to the existing research state about schizophrenia.
Reference | Related Articles | Metrics
Distributed time division multiple access scheduling strategy for wireless sensor networks
LIU Tao CHEN Yihong TAN Ying CHEN Yaqian
Journal of Computer Applications    2014, 34 (1): 8-12.   DOI: 10.11772/j.issn.1001-9081.2014.01.0008
Abstract1009)      PDF (705KB)(513)       Save
In a periodic report Wireless Sensor Network (WSN), heavy data traffic very easily leads to serious transmission collisions. This paper proposed a distributed Time Division Multiple Access (TDMA) scheduling strategy, called DTSS, to construct an appropriate transmission schedule that avoided transmission collisions. DTSS took advantage of a distributed competitive algorithm to build the transmission schedule. Each node selected its next-hop forwarding node and competed for a transmission time slot with its contending nodes. After the construction of the schedule, the nodes sent and received the data according to the schedule. The simulation results confirm DTSS avoids transmission collisions, decreases the energy consumption of nodes and significantly improves the network lifetime.
Related Articles | Metrics